Solving University Course Timetabling Problem Using Multi-Depth Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
SOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملA Genetic Algorithm Solving a Weekly Course-Timetabling Problem
In this paper we describe a heavily constrained university timetabling problem, and our genetic algorithm based approach to solve it. A problem-specific chromosome representation and knowledge-augmented genetic operators have been developed; these operators ‘intelligently’ avoid building illegal timetables. The prototype timetabling system which is presented has been implemented in C and PROLOG...
متن کاملA Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem
The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...
متن کاملSolving the Periodic Timetabling Problem using a Genetic Algorithm
In railway operations, a timetable is established to determine the departure and arrival times for the trains or other rolling stock at the different stations or relevant points inside the rail network or a subset of this network. The elaboration of this timetable is done to respond to the commercial requirements for both passenger and freight traffic, but also it must respect a set of security...
متن کاملSolving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptive Tabu Search–ATS), which is aimed at minimizing violations of soft constraints. Within ATS, a new neighborhood and a mechanism for dynamically integrating Tabu Search with perturbation (from Iterated Local Search) are proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SHS Web of Conferences
سال: 2020
ISSN: 2261-2424
DOI: 10.1051/shsconf/20207701001